package com.tgy.algorithm.base._二叉树;

public class _判断二叉树是不是完全二叉树 {

    public static BiTreeNode generalBiTreeNode() {

        /**
         *                  1
         *               2      3
         *            4    5
         */
        BiTreeNode root = new BiTreeNode(1);
        root.left = new BiTreeNode(2);
        root.right = new BiTreeNode(3);
        root.left.left = new BiTreeNode(4);
        root.left.right = new BiTreeNode(5);
//        root.right.left = new BiTreeNode(6);
//        root.right.right = new BiTreeNode(7);
        return root;
    }

    public static boolean isCompleteBiTree(BiTreeNode root) {

        return true;
    }

    public static void main(String[] args) {

    }
}
